#include <iostream>
#define MAXN 25
using namespace std;
int nums[MAXN], N, K;

void solve();

int main() {
    cin >> N;
    for (int i = 0; i < N; i++) cin >> nums[i];
    cin >> K;
    solve();
    return 0;
}

bool dfs(int now, int index) {
    if (index >= N) return false;
    int newnow = now + nums[index];
    if (newnow == K) return true;
    return dfs(now, index + 1) || dfs(newnow, index + 1);
}

void solve() {
    if (dfs(0, 0)) cout << "Yes" << endl;
    else cout << "No" << endl;
    return;
}